CYCLIC CODES OF LENTH N OVER ( ) GF q q – CYCLOTOMIC COSETS MODULO N AND APPLICATION OF BURNSIDE ’ S LEMMA
نویسنده
چکیده
The idea of q cyclotomic cosets modulo n due to carry Huffman and Vera pless is considered in the context of linear codes of length n over ( ) GF q where m q p , p is a prime, 1 m . An explicit formula for the number of q cyclostomes cosets modulo is obtained as an application of the classical Burnsides lemnra. The formula for the number of cyclic codes in ( 1) n n q R F x x is deduced. Illustration is shown for special value of q and n.
منابع مشابه
On cyclotomic cosets and code constructions
New properties of q-ary cyclotomic cosets modulo n = qm − 1, where q ≥ 3 is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of classical cyclic codes can be computed. As an application, new families of nonbinary Calderbank-Shor-Steane (CSS) quantum codes as well as new families of convolutional ...
متن کاملNarrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$
Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over GF(q) with length n = (qm−1)/(q−1). Little is known about ...
متن کاملA Universal Investigation of $n$-representations of $n$-quivers
noindent We have two goals in this paper. First, we investigate and construct cofree coalgebras over $n$-representations of quivers, limits and colimits of $n$-representations of quivers, and limits and colimits of coalgebras in the monoidal categories of $n$-representations of quivers. Second, for any given quivers $mathit{Q}_1$,$mathit{Q}_2$,..., $mathit{Q}_n$, we construct a new quiver $math...
متن کاملProjective two-weight codes with small parameters and their corresponding graphs
Let GF(q) be the n-dimensional vector space over the Galois field GF(q). The Hamming distance between two vectors of GF(q) is defined to be the number of coordinates in which they differ. A q-ary linear [n, k, d; q]-code is a k-dimensional linear subspace of GF(q) with minimum distance d. Let n(k, d) denote the smallest value of n for which an [n, k, d]-code exists. An [n(k, d), k, d]-code is c...
متن کاملPresenting cyclotomic q-Schur algebras
We give a presentation of cyclotomic q-Schur algebras by generators and defining relations. As an application, we give an algorithm for computing decomposition numbers of cyclotomic q-Schur algebras. § 0. Introduction Let Hn,r be an Ariki-Koike algebra associated to a complex reflection group Sn ⋉ (Z/rZ). A cyclotomic q-Schur algebra Sn,r associated to Hn,r, introduced in [DJM], is defined as a...
متن کامل